中英
1
shortest path algorithm中文是什么意思
- 中文翻譯
- 造句
- 最短路徑算法
- 最短路徑算則
- short adj. 1.短的；短暫的。 (opp. long)。 ...
- path n. (pl. paths ) 1.(自然踏成的)路；路 ...
- algorithm n. 【數(shù)學(xué)】算法；規(guī)則系統(tǒng)；演段。
- distributed shortest path algorithm 分布式最短路徑算法; 分散式最短路徑演算法
- shortest path 最短道路; 最短通路, 最短路徑
- k shortest path 條最短路徑
- k shortest path method 最短路徑方法
- open shortest path first 近路先開協(xié)議; 開放式最短路徑優(yōu)先; 開放最短路徑優(yōu)先; 先打開最短路徑
- open shortest path firstprotocol 優(yōu)先開放最短路徑
- pair-shortest path 對偶最短通路
- rsreduced shortest path 簡約的最短通路
- shortest path assignment 最短路徑分配
- shortest path first 最短路徑優(yōu)先
- shortest path horizontal 最短刀軌
- shortest path problem 圖論最短路; 最短道路問題; 最短路徑; 最短通路問題
- shortest path routing 最短路徑選擇; 最短途徑路由選擇
- shortest path tree 最短路徑樹
- shortest-path routing 最短路徑路由選擇
- sph shortest path heuristic 最短路徑推斷
- open shortest path firest protocol 開放式最短路徑優(yōu)先協(xié)議
- open shortest path first (ospf) 開放最短路徑優(yōu)先（協(xié)議）
- ospf open shortest path first 開放式最短通路優(yōu)先（協(xié)議）; 開放最短路徑優(yōu)先路由協(xié)議
- shortest path first protocol spfp 最短路徑優(yōu)先協(xié)議
- critical path algorithm 關(guān)鍵路徑算法; 臨界通路算法
- heuristic path algorithm 啟發(fā)式路徑算法; 試探插入算法; 試探通路算法
- Shortest path algorithm
最短路徑算則 - Shortest path algorithm with real time traffic information in dynamic vehicle routing problem
動(dòng)態(tài)車輛路徑問題中的實(shí)時(shí)最短路徑算法研究 - Shortest path algorithm based on limiting parallelogram and its application in traffic networks
平行四邊形限制最短路徑算法及其在交通網(wǎng)絡(luò)中的應(yīng)用 - An efficient method of computing the shortest path algorithm which is based on dijkstra algorithm is presented ; 4
對經(jīng)典dijkstra最短路徑搜索算法采用空間換時(shí)間的方法，提高了搜索效率； 4 - ( 2 ) utilizing the shortest path algorithm in graph theory to search functional dimension chains automatically in the assembly model and ascertain the functional dimensions of the part
( 2 )運(yùn)用圖論中的最短路徑搜索算法從裝配模型中自動(dòng)搜索出功能約束尺寸鏈，確定零件的功能尺寸。 - We set focus on solutions which include the vector map representation of city road network , the abstraction and construction of the topological structure of network , and the efficient implementation of shortest path algorithm
其中，重點(diǎn)解決了城市道路網(wǎng)的矢量地圖表達(dá)、網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)的提取和構(gòu)建、最短路徑算法的高效實(shí)現(xiàn)等關(guān)鍵技術(shù)。 - ( 4 ) an efficient approach of the shortest path algorithm which is based on dijkstra algorithm is realized . a motorcade - optimized dispatching software is realized . finally , future applications of the urban traffic flow guidance system are discussed
( 4 )用dijkstra算法實(shí)現(xiàn)了城市中兩點(diǎn)間最短路徑搜索，在此基礎(chǔ)上，實(shí)現(xiàn)了基于電子地圖的大型車隊(duì)優(yōu)化調(diào)度及管理的系統(tǒng)軟件。 - Domain ontology can be modeled a simple directed acyclic network , subsumption relation between two concepts can be computed by the ( immediate ) ancestor or descendent algorithm in a ~ ( h ) , association degree between two concepts can be computed by the shortest path algorithm in a ~ ( h )
領(lǐng)域本體可以模型化為一個(gè)簡單有向無環(huán)網(wǎng)絡(luò)，概念之間的包含關(guān)系可以通過a ~ h中的(直接)前驅(qū)后繼算法來求解，而概念之間的關(guān)聯(lián)度可以通過a ~ h中的最短路徑算法來求解。
- 更多例句： 1 2
- shortest path algorithmとは意味：最短経路｛さいたん けいろ｝アルゴリズム
- 推薦英語閱讀
shortest path algorithm的中文翻譯，shortest path algorithm是什么意思，怎么用漢語翻譯shortest path algorithm，shortest path algorithm的中文意思，shortest path algorithm的中文，shortest path algorithm in Chinese，shortest path algorithm的中文，shortest path algorithm怎么讀，發(fā)音，例句，用法和解釋由查查在線詞典提供，版權(quán)所有違者必究。
關(guān)于我們
